Waiting times in classical priority queues via elementary lattice path counting
نویسندگان
چکیده
In this paper, we describe an elementary combinatorial approach for deriving the waiting and response time distributions in a few classical priority queueing models. Bymaking use of lattice paths that are linked in a natural way to the stochastic processes analyzed, the proposed method offers new insights and complements the results previously obtained by inverting the associated Laplace transforms.
منابع مشابه
Priority queues with Gaussian input: a path-space approach to loss and delay asymptotics
Priority queueing is the basic technique for providing real-time Quality of Service to packet-based networking. The mathematical analysis of priority queues with general traffic models is, however, prohibitively difficult, in particular when the traffic is long-range dependent. This paper provides some important steps forward in this direction. Our analysis is the first mathematically rigorous ...
متن کاملTail probabilities of low-priority waiting times and queue lengths in MAP/GI/1 queues
We consider the problem of estimating tail probabilities of waiting times in statistical multiplexing systems with two classes of sources { one with high priority and the other with low priority. The priority discipline is assumed to be nonpreemptive. Exact expressions for the transforms of these quantities are derived assuming that packet or cell streams are generated by Markovian Arrival Proc...
متن کاملWaiting Time Analysis for Mx / G / 1 Priority Queues with / without Vacations under Random Order of Service Discipline
We study MX/G/1 nonpreemptive and preemptive-resume priority queues with/without vacations under random order of service (ROS) discipline within each class. By considering the conditional waiting times given the states of the system, which an arbitrary message observes upon arrival, we derive the Laplace-Stieltjes transforms of the waiting time distributions and explicitly obtain the first two ...
متن کاملMixed gated/exhaustive service in a polling model with priorities
In this paper we consider a single-server polling system with switch-over times. We introduce a new service discipline, mixed gated/exhaustive service, that can be used for queues with two types of customers: high and low priority customers. At the beginning of a visit of the server to such a queue, a gate is set behind all customers. High priority customers receive priority in the sense that t...
متن کاملOn Two Priority Multi-Server Queues with Impatient Customers
This study considers a system of multi-server queues with two classes of impatient customers: high-priority and low-priority. Customers join the system according to a Poisson process and customers may abandon service after entering the queue for an exponentially distributed duration with distinct rates. In this paper, we consider last come-first served (LCFS) and first come-first served (FCFS...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Queueing Syst.
دوره 84 شماره
صفحات -
تاریخ انتشار 2016